MATHEMATICAL ENGINEERING TECHNICAL REPORTS Generating vertices of polyhedra and related problems of monotone generation
نویسندگان
چکیده
The well-known vertex enumeration problem calls for generating all vertices of a polyhedron, given by its description as a system of linear inequalities. Recently, a number of combinatorial techniques have been developed and applied successfully to a large number of monotone generation problems in different areas. We consider four such techniques and give examples where they are applicable to vertex enumeration. We also discuss their limitations and present several hardness results for generation problems.
منابع مشابه
Generating vertices of polyhedra and related problems of monotone generation
The well-known vertex enumeration problem calls for generating all vertices of a polyhedron, given by its description as a system of linear inequalities. Recently, a number of combinatorial techniques have been developed and applied successfully to a large number of monotone generation problems in different areas. We consider four such techniques and give examples where they are applicable to v...
متن کاملGenerating vertices of polyhedra and related monotone generation problems
The well-known vertex enumeration problem calls for generating all vertices of a polyhedron given by its description as a system of linear inequalities. Recently, a number of combinatorial techniques have been developed and applied successfully to a large number of monotone generation problems from different areas. We consider several such techniques and give examples in which they are applicab...
متن کاملAdjacency on Combinatorial Polyhedra
This paper shows some useful properties of the adjacency structures of a class of combinatorial polyhedra including the equality constrained 0-1 polytopes. The class of polyhedra considered here includes 0-1 polytopes related to some combinatorial optimization problems; e.g., set partitioning polytopes, set packing polytopes, perfect matching polytopes, vertex packing polytopes and all the face...
متن کاملFr{'e}chet and Hausdorff Queries on $x$-Monotone Trajectories
vspace{0.2cm}In this paper, we design a data structure for the following problem. Let $pi$ be an $x$-monotone trajectory with $n$ vertices in the plane and $epsilon >0$. We show how to preprocess $pi$ and $epsilon$ into a data structure such that for any horizontal query segment $Q$ in the plane, one can quickly determine the minimal continuous fraction of $pi$ whose Fr{'e}chet and Hausdo...
متن کاملA strong convergence theorem for solutions of zero point problems and fixed point problems
Zero point problems of the sum of two monotone mappings and fixed point problems of a strictly pseudocontractive mapping are investigated. A strong convergence theorem for the common solutions of the problems is established in the framework of Hilbert spaces.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007